Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(x, y))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(x, y))
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence: trivial
Status: dfib2: [1,2]